Fixed-Location Circular Arc Drawing of Planar Graphs
نویسندگان
چکیده
منابع مشابه
Fixed-Location Circular Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in the plane. If for every edge we have only two possible circular arcs, then a simple reduction to 2SAT yields an O(n) algorithm to find out if a drawing with no crossings can be realized, where n is the number of vertice...
متن کاملFixed-Location Circular-Arc Drawing
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges and given a one-to-one mapping between the vertices of the graph and a set of n points on the plane, where n is the number of vertices in the graph. If for every edge we have only two possible circular arcs, then there a simple reduction to 2SAT yields an O(n) algorithm to find out if a drawing with no ...
متن کاملDrawing Planar Graphs with Circular Arcs
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm ru...
متن کاملUniversal Point Sets for Drawing Planar Graphs with Circular Arcs
We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a planar drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc. Submitted: October 2013 Reviewed: February 2014 Revised: March 2014 Accepted: April 2014 Final: May 2014 Published: May 2014 Article type: Regular paper Communicat...
متن کاملOn the Shooter Location Problem: Maintaining Dynamic Circular-Arc Graphs
We present a data structure for maintaining the Minimum Clique cover and Maximum Independent Set of a circular-arc graph. These functions can be maintained during the interchange of adjacent arc endpoints in O(logn) amortized time per interchange. The new data structure extends the dynamic tree structure of Sleator and Tarjan [5] so that cutting and linking up to O(n) subtrees can be done in on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2007
ISSN: 1526-1719
DOI: 10.7155/jgaa.00140